An analytical model of adaptive wormhole routing with time-out

Several studies have shown that the performance advantages of adaptive routing over deterministic routing are reduced when the traffic contains strong degree of communication locality. This paper proposes a new analytical model of an adaptive routing algorithm proposed by Duato in [Dua94]. The main feature of this algorithm is the use of a time-out selection function for assigning virtual channels. This has the advantage of reducing virtual channels multiplexing to improve the network performance, especially, in the presence of communication locality. Simulation experiments reveal that the proposed model predicts message latency with a good degree of accuracy under different traffic conditions.